Exploration
Accueil
Racine
Exploration
Accueil
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

Identifieur interne : 000D88 ( Main/Exploration ); précédent : 000D87; suivant : 000D89

A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes

Auteurs : Laszlo Szathmary [Hongrie] ; Petko Valtchev [Canada] ; Amedeo Napoli [France] ; Robert Godin [Canada] ; Alix Boc [Canada] ; Vladimir Makarenkov [Canada]

Source :

RBID : Hal:hal-01101140

English descriptors

Abstract

In pattern mining and association rule mining, there is a variety of algo-rithms for mining frequent closed itemsets (FCIs) and frequent generators (FGs), whereas a smaller part further involves the precedence relation between FCIs. The interplay of these three constructs and their joint computation have been studied within the formal concept analysis (FCA) field yet none of the proposed algorithms is scalable. In frequent pattern mining, at least one suite of efficient algorithms has been designed that exploits basically the same ideas and follows the same overall computational schema. Based on an in-depth analysis of the aforementioned inter-play that is rooted in a fundamental duality from hypergraph theory, we propose a new schema that should enable for a more parsimonious computation. We exemplify L. Szathmary (B) L. Szathmary et al. the new schema in the design of Snow-Touch, a concrete FCI/FG/precedence miner that reuses an existing algorithm, Charm, for mining FCIs, and completes it with two original methods for mining FGs and precedence, respectively. The performance of Snow-Touch and of its closest competitor, Charm-L, were experimentally compared using a large variety of datasets. The outcome of the experimental study suggests that our method outperforms Charm-L on dense data while on sparse one the trend is reversed. Furthermore, we demonstrate the usefulness of our method and the new schema through an application to the analysis of a genome dataset. The initial results reported here confirm the capacity of the method to focus on significant associations.

Url:
DOI: 10.1007/s10472-013-9372-8


Affiliations:

Links toward previous steps (curation, corpus...)

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en">A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes</title>
<author>
<name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-210385" status="VALID">
<orgName>Computer Science Laboratory</orgName>
<desc>
<address>
<country key="HU"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-300833" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300833" type="direct">
<org type="institution" xml:id="struct-300833" status="VALID">
<orgName>University of Debrecen</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Hongrie</country>
</affiliation>
</author>
<author>
<name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author>
<name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
<affiliation wicri:level="1">
<hal:affiliation type="researchteam" xml:id="struct-205125" status="VALID">
<idno type="RNSR">200818291B</idno>
<orgName>Knowledge representation, reasonning</orgName>
<orgName type="acronym">ORPAILLEUR</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/orpailleur</ref>
</desc>
<listRelation>
<relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423086" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-129671" type="direct">
<org type="laboratory" xml:id="struct-129671" status="VALID">
<idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc>
<address>
<addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect">
<org type="institution" xml:id="struct-300009" status="VALID">
<orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc>
<address>
<addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423086" type="direct">
<org type="department" xml:id="struct-423086" status="VALID">
<orgName>Department of Natural Language Processing & Knowledge Discovery</orgName>
<orgName type="acronym">LORIA - NLPKD</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/Knowledge-and-Language-Management</ref>
</desc>
<listRelation>
<relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect">
<org type="laboratory" xml:id="struct-206040" status="VALID">
<idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc>
<address>
<addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect">
<org type="institution" xml:id="struct-413289" status="VALID">
<idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc>
<address>
<addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect">
<org type="institution" xml:id="struct-441569" status="VALID">
<idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc>
<address>
<country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author>
<name sortKey="Godin, Robert" sort="Godin, Robert" uniqKey="Godin R" first="Robert" last="Godin">Robert Godin</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author>
<name sortKey="Boc, Alix" sort="Boc, Alix" uniqKey="Boc A" first="Alix" last="Boc">Alix Boc</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author>
<name sortKey="Makarenkov, Vladimir" sort="Makarenkov, Vladimir" uniqKey="Makarenkov V" first="Vladimir" last="Makarenkov">Vladimir Makarenkov</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:hal-01101140</idno>
<idno type="halId">hal-01101140</idno>
<idno type="halUri">https://hal.inria.fr/hal-01101140</idno>
<idno type="url">https://hal.inria.fr/hal-01101140</idno>
<idno type="doi">10.1007/s10472-013-9372-8</idno>
<date when="2014">2014</date>
<idno type="wicri:Area/Hal/Corpus">000673</idno>
<idno type="wicri:Area/Hal/Curation">000673</idno>
<idno type="wicri:Area/Hal/Checkpoint">000D82</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000D82</idno>
<idno type="wicri:doubleKey">1012-2443:2014:Szathmary L:a:fast:compound</idno>
<idno type="wicri:Area/Main/Merge">000D82</idno>
<idno type="wicri:Area/Main/Curation">000D88</idno>
<idno type="wicri:Area/Main/Exploration">000D88</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en">A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes</title>
<author>
<name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-210385" status="VALID">
<orgName>Computer Science Laboratory</orgName>
<desc>
<address>
<country key="HU"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-300833" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-300833" type="direct">
<org type="institution" xml:id="struct-300833" status="VALID">
<orgName>University of Debrecen</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Hongrie</country>
</affiliation>
</author>
<author>
<name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author>
<name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
<affiliation wicri:level="1">
<hal:affiliation type="researchteam" xml:id="struct-205125" status="VALID">
<idno type="RNSR">200818291B</idno>
<orgName>Knowledge representation, reasonning</orgName>
<orgName type="acronym">ORPAILLEUR</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/orpailleur</ref>
</desc>
<listRelation>
<relation active="#struct-129671" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-423086" type="direct"></relation>
<relation active="#struct-206040" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-129671" type="direct">
<org type="laboratory" xml:id="struct-129671" status="VALID">
<idno type="RNSR">198618246Y</idno>
<orgName>INRIA Nancy - Grand Est</orgName>
<desc>
<address>
<addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/nancy</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect">
<org type="institution" xml:id="struct-300009" status="VALID">
<orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc>
<address>
<addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-423086" type="direct">
<org type="department" xml:id="struct-423086" status="VALID">
<orgName>Department of Natural Language Processing & Knowledge Discovery</orgName>
<orgName type="acronym">LORIA - NLPKD</orgName>
<desc>
<address>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr/la-recherche-en/departements/Knowledge-and-Language-Management</ref>
</desc>
<listRelation>
<relation active="#struct-206040" type="direct"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-413289" type="indirect"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-206040" type="indirect">
<org type="laboratory" xml:id="struct-206040" status="VALID">
<idno type="IdRef">067077927</idno>
<idno type="RNSR">198912571S</idno>
<idno type="IdUnivLorraine">[UL]RSI--</idno>
<orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<date type="start">2012-01-01</date>
<desc>
<address>
<addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-413289" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle active="#struct-413289" type="indirect">
<org type="institution" xml:id="struct-413289" status="VALID">
<idno type="IdRef">157040569</idno>
<idno type="IdUnivLorraine">[UL]100--</idno>
<orgName>Université de Lorraine</orgName>
<orgName type="acronym">UL</orgName>
<date type="start">2012-01-01</date>
<desc>
<address>
<addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.univ-lorraine.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect">
<org type="institution" xml:id="struct-441569" status="VALID">
<idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc>
<address>
<country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName>
<settlement type="city">Nancy</settlement>
<settlement type="city">Metz</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université de Lorraine</orgName>
</affiliation>
</author>
<author>
<name sortKey="Godin, Robert" sort="Godin, Robert" uniqKey="Godin R" first="Robert" last="Godin">Robert Godin</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author>
<name sortKey="Boc, Alix" sort="Boc, Alix" uniqKey="Boc A" first="Alix" last="Boc">Alix Boc</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author>
<name sortKey="Makarenkov, Vladimir" sort="Makarenkov, Vladimir" uniqKey="Makarenkov V" first="Vladimir" last="Makarenkov">Vladimir Makarenkov</name>
<affiliation wicri:level="1">
<hal:affiliation type="laboratory" xml:id="struct-38354" status="VALID">
<orgName>Département d'informatique [Canada]</orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<country key="CA"></country>
</address>
</desc>
<listRelation>
<relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles>
<tutelle active="#struct-360045" type="direct">
<org type="institution" xml:id="struct-360045" status="VALID">
<orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc>
<address>
<addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
</analytic>
<idno type="DOI">10.1007/s10472-013-9372-8</idno>
<series>
<title level="j">Annals of Mathematics and Artificial Intelligence</title>
<idno type="ISSN">1012-2443</idno>
<imprint>
<date type="datePub">2014</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="mix" xml:lang="en">
<term>Formal Concept Analysis</term>
<term>association rules</term>
<term>pattern mining</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">In pattern mining and association rule mining, there is a variety of algo-rithms for mining frequent closed itemsets (FCIs) and frequent generators (FGs), whereas a smaller part further involves the precedence relation between FCIs. The interplay of these three constructs and their joint computation have been studied within the formal concept analysis (FCA) field yet none of the proposed algorithms is scalable. In frequent pattern mining, at least one suite of efficient algorithms has been designed that exploits basically the same ideas and follows the same overall computational schema. Based on an in-depth analysis of the aforementioned inter-play that is rooted in a fundamental duality from hypergraph theory, we propose a new schema that should enable for a more parsimonious computation. We exemplify L. Szathmary (B) L. Szathmary et al. the new schema in the design of Snow-Touch, a concrete FCI/FG/precedence miner that reuses an existing algorithm, Charm, for mining FCIs, and completes it with two original methods for mining FGs and precedence, respectively. The performance of Snow-Touch and of its closest competitor, Charm-L, were experimentally compared using a large variety of datasets. The outcome of the experimental study suggests that our method outperforms Charm-L on dense data while on sparse one the trend is reversed. Furthermore, we demonstrate the usefulness of our method and the new schema through an application to the analysis of a genome dataset. The initial results reported here confirm the capacity of the method to focus on significant associations.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Canada</li>
<li>France</li>
<li>Hongrie</li>
</country>
<region>
<li>Grand Est</li>
<li>Lorraine (région)</li>
</region>
<settlement>
<li>Metz</li>
<li>Nancy</li>
</settlement>
<orgName>
<li>Université de Lorraine</li>
</orgName>
</list>
<tree>
<country name="Hongrie">
<noRegion>
<name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name>
</noRegion>
</country>
<country name="Canada">
<noRegion>
<name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
</noRegion>
<name sortKey="Boc, Alix" sort="Boc, Alix" uniqKey="Boc A" first="Alix" last="Boc">Alix Boc</name>
<name sortKey="Godin, Robert" sort="Godin, Robert" uniqKey="Godin R" first="Robert" last="Godin">Robert Godin</name>
<name sortKey="Makarenkov, Vladimir" sort="Makarenkov, Vladimir" uniqKey="Makarenkov V" first="Vladimir" last="Makarenkov">Vladimir Makarenkov</name>
</country>
<country name="France">
<region name="Grand Est">
<name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
</region>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000D88 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000D88 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    RBID
   |clé=     Hal:hal-01101140
   |texte=   A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022